Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
نویسندگان
چکیده
The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very
منابع مشابه
A New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملEmpirical Studies of Heuristic Local Search for Constraint Solving
Abs t rac t . The goal of this paper is twofold. First, we introduce a class of local search procedures for solving optimization and constraint problems. These procedures are based on various heuristics for choosing variables and values in order to examine a general neighborhood. Second, four combinations of heuristics are empirically evaluated by using the graph-coloring problem and a real wor...
متن کاملSolving A Fractional Program with Second Order Cone Constraint
We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...
متن کاملFUZZY LINEAR PROGRAMMING WITH GRADES OF SATISFACTION IN CONSTRAINTS
We present a new model and a new approach for solving fuzzylinear programming (FLP) problems with various utilities for the satisfactionof the fuzzy constraints. The model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (DM), andallows for the assignment of distinct weights to the constraints and the objectivefunction. The desired solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1001.1093 شماره
صفحات -
تاریخ انتشار 2010